The Buffer Tree: A Technique for Designing Batched External Data Structures1
نویسندگان
چکیده
We present a technique for designing external memory data structures that support batched operations I/O efficiently. We show how the technique can be used to develop external versions of a search tree, a priority queue, and a segment tree, and give examples of how these structures can be used to develop I/Oefficient algorithms. The developed algorithms are either extremely simple or straightforward generalizations of known internal memory algorithms—given the developed external data structures.
منابع مشابه
External-Memory Algorithms with Applications in GIS
Preface In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing Input/Output (I/O) communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this note we survey the recent developments in external-memory algorithms with applications in ...
متن کاملEfficient External-Memory Data Structures and Applications
In this thesis we study the Input/Output (I/O) complexity of large-scale problems arising e.g. in the areas of database systems, geographic information systems, VLSI design systems and computer graphics, and design I/O-efficient algorithms for them. A general theme in our work is to design I/O-efficient algorithms through the design of I/O-efficient data structures. One of our philosophies is t...
متن کاملBuffering ⊲ Packet Switching in Single Buffer Bufferless Packet Switching ⊲
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988) 2. Arge, L.A.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–357. Kluwer, Dordrecht (2002) 3. Arge, L.A.: The Buffer Tree: A technique for designing batched external data structures. Algorith...
متن کاملThe Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms
In this paper, we present a probabilistic self-balancing dictionary data structure for massive data sets, and prove expected amortized I/O-optimal bounds on the dictionary operations. We show how to use the structure as an I/O-optimal priority queue. The data structure, which we call as the random buffer tree, abstracts the properties of the random treap and the buffer tree. The random buffer t...
متن کاملThe Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
In this paper we develop a technique for transforming an internal-memory tree data structure into an external-memory structure. We show how the technique can be used to develop a search tree like structure , a priority queue, a (one-dimensional) range tree and a segment tree, and give examples of how these structures can be used to develop eecient I/O algorithms. All our algorithms are either e...
متن کامل